Reasoning about XML with temporal logics and automata

Reasoning about XML with Temporal Logics and Automata

We show that problems arising in static analysis of XML specifications and transformations can be dealt with using techniques similar to those developed for static analysis of programs. Many properties of interest in the XML context are related to navigation, and can be formulated in temporal logics for trees. We choose a logic that admits a simple single-exponential translation into unranked t...

Temporal logics for reasoning about quantum systems

Reasoning about quantum systems has gained prominence due to a big potential in applications such as information processing, security, distributed systems and randomized algorithms. This fact has attracted research in formal reasoning about quantum states, programs and processes. On the other hand, temporal logics have proved to be successful in the verification of classical distributed systems...

Temporal Logics and Temporal Reasoning

Branching Temporal Description Logics: Reasoning about CTLALC and CTLEL concepts

In many applications of description logics (DLs) it is no longer enough to describe the static aspects of the application domain. In particular, there is a need to formalize the temporal evolution of an application domain. This is the case, for example, if we want to use DLs as conceptual modeling languages for temporal databases. Another example are medical ontologies, where the representation...

Reasoning About Actions with Description Logics

In this paper we will show that a recently proposed method for ABox updates in Description Logics can be given a Fluent Calculus semantics. This allows the usage of Description Logic ABoxes as decidable state descriptions. We discuss some natural extensions of the method and the arising issues. Finally, we present an action programming language implementing this Fluent Calculus fragment using a...